منابع مشابه
Fast Algorithms for Computing Tree LCS
The LCS of two rooted, ordered, and labeled trees F and G is the largest forest that can be obtained from both trees by deleting nodes. We present algorithms for computing tree LCS which exploit the sparsity inherent to the tree LCS problem. Assuming G is smaller than F , our first algorithm runs in time O(r · height(F ) · height(G) · lg lg |G|), where r is the number of pairs (v ∈ F,w ∈ G) suc...
متن کاملFast Algorithms for Computing the Constrained LCS of Run-Length Encoded Strings
In the constrained longest common subsequence (CLCS) problem, we are given two sequences X , Y and the constrained sequence P in run-length encoded (RLE) format, where |X| = n, |Y | = m and |P | = r and the numbers of runs in RLE format are N , M and R, respectively. In this paper, we show that after the sequences are encoded, the CLCS problem can be solved in O(NMr+ r × min{q1, q2} + q3) time,...
متن کاملNew Efficient Algorithms for LCS and Constrained LCS Problem
In this paper, we study the classic and well-studied longest common subsequence (LCS) problem and a recent variant of it namely constrained LCS (CLCS) problem. In CLCS, the computed LCS must also be a supersequence of a third given string. In this paper, we first present an efficient algorithm for the traditional LCS problem that runs in O(R log log n + n) time, where R is the total number of o...
متن کاملNew efficient algorithms for the LCS and constrained LCS problems
In this paper, we study the classic and well-studied longest common subsequence (LCS) problem and a recent variant of it, namely the constrained LCS (CLCS) problem. In the CLCS problem, the computed LCS must also be a supersequence of a third given string. In this paper, we first present an efficient algorithm for the traditional LCS problem that runs in O(R log logn+ n) time, where R is the to...
متن کاملFast Algorithms for Computing Binary Correlation
Cross-correlation is widely used to match images. Cross-correlation of windows where pixels have binary values is necessary when thresholded sign-of-laplacian images are matched. Nishihara proposed that the sign of the laplacian of an image be used as a characteristic, that is robust to illumination changes and noise, to match images. Thresholding the sign of the laplacian of an image results i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.07.011